Axiomatizing higher-order Kleene realizability
نویسندگان
چکیده
منابع مشابه
Colin Mclarty Semantics for First and Higher Order Realizability
First order Kleene realizability is given a semantic interpretation, including arithmetic and other types. These types extend at a stroke to full higher order intuitionistic logic. They are also useful themselves, e.g., as models for lambda calculi, for which see Asperti and Longo 1991 and papers on PERs and polymorphism (IEEE 1990). This semantics is simpler and more explicit than in Hyland 19...
متن کاملA relational realizability model for higher-order stateful ADTs
We present a realizability model for reasoning about contextual equivalence of higher-order programs with impredicative polymorphism, recursive types, and higher-order mutable state. The model combines the virtues of two recent earlier models: (1) Ahmed, Dreyer, and Rossberg’s step-indexed logical relations model, which was designed to facilitate proofs of representation independence for “state...
متن کاملAxiomatizing Higher Level Delimited Continuation
In our previous work we gave a sound and complete axiomatization of the control operators for delimited continuations, shift and reset by Danvy and Filinski and their variants. Since the calculus allows only one use of shift and reset, a next step is to investigate the calculus with many different shift’s and reset’s. In this work, we study the calculus with higher-level delimited continuation ...
متن کاملAn Extensional Kleene Realizability Semantics for the Minimalist Foundation
We build a Kleene realizability semantics for the two-level Minimalist Foundation MF, ideated by Maietti and Sambin in 2005 and completed by Maietti in 2009. Thanks to this semantics we prove that both levels of MF are consistent with the formal Church Thesis CT. Since MF consists of two levels, an intensional one, called mTT, and an extensional one, called emTT, linked by an interpretation, it...
متن کاملAxiomatizing first-order consequences in independence logic
Independence logic, introduced in [5], cannot be effectively axiomatized. However, first-order consequences of independence logic sentences can be axiomatized. In this article we give an explicit axiomatization and prove that it is complete in this sense. The proof is a generalization of the similar result for dependence logic introduced in [8].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1994
ISSN: 0168-0072
DOI: 10.1016/0168-0072(94)90070-1